Smoothed aggregation for Helmholtz problems
نویسندگان
چکیده
منابع مشابه
Smoothed aggregation for Helmholtz problems
We outline a smoothed aggregation algebraic multigrid method for 1D and 2D scalar Helmholtz problems with exterior radiation boundary conditions. We consider standard 1D finite difference discretizations and 2D discontinuous Galerkin discretizations. The scalar Helmholtz problem is particularly difficult for algebraic multigrid solvers. Not only can the discrete operator be complex-valued, inde...
متن کاملTowards Adaptive Smoothed Aggregation (αsa) for Nonsymmetric Problems
Applying smoothed aggregation multigrid (SA) to solve a nonsymmetric linear system, Ax = b, is often impeded by the lack of a minimization principle that can be used as a basis for the coarse-grid correction process. This paper proposes a Petrov-Galerkin (PG) approach based on applying SA to either of two symmetric positive definite (SPD) matrices, √ AtA or √ AAt. These matrices, however, are t...
متن کاملAdaptive Smoothed Aggregation (αSA)
Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the large linear systems encountered in engineering practice. These systems often arise from discretizing partial differential equations over unstructured meshes, and the particular parameters or geometry of the physical problem being discretized may be unavailable to the ...
متن کاملA generalized eigensolver based on smoothed aggregation (GES-SA) for initializing smoothed aggregation (SA) multigrid
Consider the linear system Ax = b, where A is a large, sparse, real, symmetric, and positive definite matrix and b is a known vector. Solving this system for unknown vector x using a smoothed aggregation multigrid (SA) algorithm requires a characterization of the algebraically smooth error, meaning error that is poorly attenuated by the algorithm’s relaxation process. For many common relaxation...
متن کاملSmoothed Aggregation Multigrid for Markov Chains
A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown how smoothing the interpolation and restriction operators can dramatically increase the efficiency of aggregation multigrid methods for Markov chains that have been proposed in the literature. The proposed smoothing approach i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2010
ISSN: 1070-5325,1099-1506
DOI: 10.1002/nla.686